A Boolean Algebra Approach for Class Hierarchy Normalization
نویسندگان
چکیده
Normalization in object-oriented design is much different from that in relational database design. Not only are the conceptual data model of objectoriented (o-o) models integrating m’cher structuring capabilities than that of relational models, but also the dependency constraints, attribute ranges and access paths in o-o models are more complex than that in relational models. In o-o models, inheritance semantics is expressed mainly by class hierarchy, and it is important to ensure and maintain an appropriate class hierarchy. In this paper, we propose a Boolean algebra approach for class hierarchy normalization. A class hierarchy normal form(CHNF) and an indexing model for class hierarchy are defined respectively. Some methods and algorithms, such as transformation from a non-CHNF class hierarchy to a CHNF one, are given.
منابع مشابه
Lattice of weak hyper K-ideals of a hyper K-algebra
In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...
متن کاملOn some classes of expansions of ideals in $MV$-algebras
In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate and $ (tau,sigma)$-Boolean in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...
متن کاملThe Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
For some fixed alphabet A with jAj 2, a language L A is in the class L1=2 of the Straubing-Thérien hierarchy if and only if it can be expressed as a finite union of languages A a1A a2A A anA , where ai 2 A and n 0. The class L1 is defined as the boolean closure ofL1=2. It is known that the classesL1=2 andL1 are decidable. We give a membership criterion for the single classes of the boolean hier...
متن کاملOn Quantified Propositional Logics and the Exponential Time Hierarchy
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae. We show that the truth evaluation for ADQBF is AEXPTIME(poly)-complete. We also identify fragments for which the problem is complete for the levels of the e...
متن کاملClass Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other’s definitions. This permits data from relational databases, objectoriented databases, and tagged XML documents to be unioned into one distributed ontology, sharable by all users without the need for prior negotiation or the development of a “standard” ontology for each field...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997